Switching Circuit Optimization for Matrix Gradient Coils
نویسندگان
چکیده
منابع مشابه
Optimization of Biplanar Gradient Coils for Magnetic Resonance Imaging
“Open” magnetic resonance imaging (MRI) scanners are frequently based on electromagnets or permanent magnets, and require self-shielded planar gradient coils to prevent image artifacts resulting from eddy currents in metallic parts of the scanner. This work presents an optimization method for the development of self-shielded gradient coils with biplanar geometry for “Open” MRI scanners. Compare...
متن کاملImproving the Efficiency of Digitally Controlled Switching Gradient Amplifiers for Driving Different Gradient Insert Coils
Introduction: High-performance MRI systems demand the use of digitally controlled switching gradient amplifiers (SGAs) that need complex electronic circuits and control algorithms to achieve not only good image quality but also good power efficiency [1-2]. Moreover, the imaging capabilities of clinical MRI system may be improved by the use of gradient insert coils that achieve gradient amplitud...
متن کاملInsert Dome Gradient Coils for Brain Imaging
J. Leggett, D. Green, R. Bowtell Sir Peter Mansfield Magnetic Resonance Centre, School of Physics and Astronomy, University of Nottingham, Nottingham, United Kingdom Introduction Insert gradient coils offer significant advantages for brain imaging as a result of the large increase in gradient performance that is achieved as the coil size is reduced. It has been shown previously that head-sized ...
متن کاملConjugate Gradient Algorithm for Optimization Under Unitary Matrix Constraint1
In this paper we introduce a Riemannian algorithm for minimizing (or maximizing) a real-valued function J of complex-valued matrix argument W under the constraint that W is an n × n unitary matrix. This type of constrained optimization problem arises in many array and multi-channel signal processing applications. We propose a conjugate gradient (CG) algorithm on the Lie group of unitary matrice...
متن کاملConjugate gradient algorithm for optimization under unitary matrix constraint
In this paper we introduce a Riemannian algorithm for minimizing (or maximizing) a real-valued functionJ of complex-valued matrix argumentW under the constraint that W is an n n unitary matrix. This type of constrained optimization problem arises in many array and multi-channel signal processing applications. We propose a conjugate gradient (CG) algorithm on the Lie group of unitary matrices Uð...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tomography
سال: 2019
ISSN: 2379-139X
DOI: 10.18383/j.tom.2018.00056